Subword histories and associated matrices
نویسنده
چکیده
The basic numerical quantity investigated in this paper is |w|u, the number of occurrences of a word u as a scattered subword of a word w. Arithmetical combinations of such quantities yield a so-called subword history. We investigate the information content of subword histories. Reducing subword histories to linear ones, as well as the recently introduced Parikh matrices, will be important tools. Simple polynomial formulas for computing the value of a subword history for arbitrary powers of a word are obtained. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
On Inequalities between Subword Histories
By taking out letters from a word we get a subword. Both continuous sub-words (also called factors or simply subwords) and scattered subwords were extensively studied. In [4] the authors introduced Parikh matrices, structures that contain more information about the words than Parikh vectors, which tell us only the number of di $ffere\tau 1T$ letters building the word. $I_{l1}[5]$ the notion of ...
متن کاملExtremal sequences of polynomial complexity 3
The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called extremal if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. ...
متن کاملExtremal sequences of polynomial complexity
The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called extremal if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. ...
متن کاملA Note on the Decidability of subword inequalities
Extending the general undecidability result concerning the absoluteness of inequalities between subword histories, in this paper we show that the question whether such inequalities hold for all words is undecidable already over a binary alphabet and bounded number of blocks, and even in very simple cases an answer requires an intractable computation.
متن کاملSome properties of a class of polyhedral semigroups based upon the subword reversing method
In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined. The completeness of the presentation and solvability of word problem of this class of semigroups is determined. Moreover the combinatorial distance between two words is determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 407 شماره
صفحات -
تاریخ انتشار 2008